Another Extremal Property of Some Turan Graphs
نویسندگان
چکیده
منابع مشابه
An Extremal Property of Turán Graphs
Let Fn,tr(n) denote the family of all graphs on n vertices and tr(n) edges, where tr(n) is the number of edges in the Turán’s graph Tr(n) – the complete r-partite graph on n vertices with partition sizes as equal as possible. For a graph G and a positive integer λ, let PG(λ) denote the number of proper vertex colorings of G with at most λ colors, and let f(n, tr(n), λ) = max{PG(λ) : G ∈ Fn,tr(n...
متن کاملSOME EXTREMAL PROBLEMS ON r-GRAPHS
1 . Introduction . By an r-graph we mean a fixed set of vertices together with a class of unordered subsets of this fixed set, each subset containing exactly r elements and called an r-tuple . In the language of Berge [2j this is a simple uniform hypergraph of rank r . The concept becomes interesting only for r > 1 : for r = 2 we obtain ordinary (i .e ., Michigan) graphs . We shall represent an...
متن کاملSome Graphs with Extremal Pi Index
The Padmakar-Ivan (PI) index is a Wiener-Szeged-like topological index, which reflects certain structural features of organic molecules. In this paper, we study the maximum PI indices and the minimum PI indices for trees and unicyclic graphs respectively.
متن کاملExtremal graphs in some coloring problems
For a simple graph G with chromatic number x(G), the Nordhaus-Gaddum inequalities give upper and lower bounds for z(G)•(G ¢) and z(G)+ x(GC). Based on a characterization by Fink of the extremal graphs G attaining the lower bounds for the product and sum, we characterize the extremal graphs G for which A(G)B(G c) is minimum, where A and B are each of chromatic number, achromatic number and pseud...
متن کاملSome Extremal Problems for Edge-Regular Graphs
We consider the class ER(n, d, λ) of edge-regular graphs for some n > d > λ, i.e., graphs regular of degree d on n vertices, with each pair of adjacent vertices having λ common neighbors. It has previously been shown that for such graphs with λ > 0 we have n ≥ 3(d − λ) and much has been done to characterize such graphs when equality holds. Here we show that n ≥ 3(d − λ) + 1 if λ > 0 and d is od...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 1987
ISSN: 0195-6698
DOI: 10.1016/s0195-6698(87)80016-1